منابع مشابه
Surface Reconstruction via L1-Minimization
A surface reconstruction technique based on the Lminimization of the variation of the gradient is introduced. This leads to a non-smooth convex programming problem. Well-posedness and convergence of the method is established and an interior point based algorithm is introduced. The L-surface reconstruction algorithm is illustrated on various test cases including natural and urban terrain data.
متن کاملWeighted Model Reduction Via Interpolation
Weighted model reduction problems appear in many important applications such as controller reduction. The most common approach to this problem is the weighted balanced truncation method. Interpolatory approaches to weighted model reduction have been mostly limited to simply choosing interpolation points in the regions where the weights are dominant. In this paper, we extend the (unweighted) tan...
متن کاملMaximal Sparsity Representation via l1 Minimization
Finding a sparse representation of signals is desired in many applications. For a representation dictionary D and a given signal S ∈ span{D}, we are interested in finding the sparsest vector γ such that Dγ = S. Previous results have shown that if D is composed of a pair of unitary matrices, then under some restrictions dictated by the nature of the matrices involved, one can find the sparsest r...
متن کاملGraph Cuts via l1 Norm Minimization
Graph cuts have become an increasingly important tool for solving a number of energy minimization problems in computer vision and other fields. In this paper, the graph cut problem is reformulated as an unconstrained l1 norm minimization that can be solved effectively using interior point methods. This reformulation exposes connections between the graph cuts and other related continuous optimiz...
متن کاملSparse Legendre expansions via l1-minimization
We consider the problem of recovering polynomials that are sparse with respect to the basis of Legendre polynomials from a small number of random samples. In particular, we show that a Legendre s-sparse polynomial of maximal degree N can be recovered fromm s log(N) random samples that are chosen independently according to the Chebyshev probability measure dν(x) = π−1(1 − x2)−1/2dx. As an effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2016
ISSN: 1063-5203
DOI: 10.1016/j.acha.2015.02.003